Point algebras for temporal reasoning: Algorithms and complexity
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Temporal Reasoning
We consider a representation for temporal relations between intervals introduced by James Allen, and its associated computational or reasoning problem: given possibly indefinite knowledge of the relations between some intervals, how do we compute the strongest possible assertions about the relations between some or all intervals. Determining exact solutions to this problem has been shown to be ...
متن کاملfixed point property for banach algebras associated to locally compact groups
در این پایان نامه به بررسی خاصیت نقطه ثابت و خاصیت نقطه ثابت برای نیم گروههای برگشت پذیر چپ روی بعضی جبرهای باناخ از جمله جبر فوریه و جبر فوریه استیلتیس پرداخته شده است. برای مثال بیان شده است که اگر گروه یک گروه فشرده موضعی با همسایگی فشرده برای عنصر همانی که تحت درونریختی ها پایاست باشد آنگاه جبر فوریه و جبر فوریه استیلتیس دارای خاصیت نقطه ثابت برای نیم گروه های برگشت پذیر چپ است اگر و تنها ا...
15 صفحه اولOn point-duration networks for temporal reasoning
We present here a point-duration network formalism which extends the point algebra model to include additional variables that represent durations between points of time. Thereafter the new qualitative model is enlarged for allowing unary metric constraints on points and durations, subsuming in this way several point-based approaches to temporal reasoning. We deal with some reasoning tasks withi...
متن کاملSome Algebras and Algorithms for Reasoning about Time and Space
Constraint networks over relation algebras are deened. Compass algebras are introduced for reasoning about space. They are related to the interval algebras, which are used for reasoning about time. The problem of determining whether a network has a closed zeroless reduction is shown to NP-complete for almost all compass and interval algebras. This implies constraint satisfaction for these algeb...
متن کاملConstraint Propagation Algorithms for Temporal Reasoning
This paper considers computational aspects of several temporal representation languages. It investigates an interval-based representation, and a point-based one. Computing the consequences of temporal assertions is shown to be computational/y intractable in the interval-based representation, but not in the poinfbased one. However, a fragment of the interval language can be expressed using the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2003
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(03)00075-4